Lattices of Multi-player Games
نویسنده
چکیده
In combinatorial games, few results are known about the overall structure of multi-player games. We prove that given any finite set S of multi-player games, the set of games all of whose immediate options belong to S forms a completely distributive lattice with respect to every partial order relation ≤C, where C is an arbitrary coalition of players.
منابع مشابه
حمایت نظام حقوق مالکیت فکری از حقوق بازیباز کنشگردر بازیهای رایانهای
Nowadays video games are fast becoming one of the most popular media of choice. For more than thirty years now video games are amongst us. At the start being a new form of entertainment for the youth only, in no time it has grown into a medium enjoyed and used for various purposes by consumers of all ages. The global market for video games is still expected to grow substantially in the upcoming...
متن کاملDynamic Properties of Evolutionary Multi-player Games in Finite Populations
William D. Hamilton famously stated that “human life is a many person game and not just a disjoined collection of two person games”. However, most of the theoretical results in evolutionary game theory have been developed for two player games. In spite of a multitude of examples ranging from humans to bacteria, multi-player games have received less attention than pairwise games due to their inh...
متن کاملEnhancements for Multi-Player Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is becoming increasingly popular for playing multi-player games. In this paper we propose two enhancements for MCTS in multi-player games: (1) Progressive History and (2) Multi-Player Monte-Carlo Tree Search Solver (MP-MCTS-Solver). We analyze the performance of these enhancements in two different multi-player games: Focus and Chinese Checkers. Based on the experi...
متن کاملPlayer Modeling, Search Algorithms and Strategies in Multi-player Games
For a long period of time, two person zero-sum games have been in the focus of researchers of various communities. The efforts were mainly driven by the fascination of special competitions like Deep Blue vs. Kasparov, and of the beauty of parlor games like Checkers, Backgammon, Othello and Go. Multi-player games, however, have been inspected by far less, and although literature of game theory f...
متن کاملSearch Policies in Multi - Player Games 1
In this article we investigate how three multi-player search policies, namely maxn, paranoid, and Best-Reply Search, can be embedded in the MCTS framework. The performance of these search policies is tested in four different deterministic multi-player games with perfect information by running self-play experiments. We show that MCTS with the maxn search policy overall performs best. Furthermore...
متن کامل